Laurier Flow
⌘K

© 2026 LaurierFlow. All rights reserved.

AboutPrivacy

Schedule

Contributed by Students

Course Outlines

to view and upload course outlines

Reviews

No Reviews With Body Yet

MA 238

Discrete Mathematics

Basic graph theory, Euler circuits and Hamilton cycles in graphs, planar graphs, graph colouring, trees, relations, partial orders, introduction to counting, recurrence relations, inclusion-exclusion. Prerequisites: MA122 and either MA120 or MA121.

0%Liked
0%Easy
0%Useful
Based on 0 ratings

Prerequisites

MA 122 (Min. Grade D-) and (MA 120 (Min. Grade D-) or MA 121 (Min. Grade D-) )

Leads To

CP 312, CP 414, MA 338

Restrictions

Must be enrolled in one of the following Levels:Undergraduate (UG)Must be enrolled in one of the following Majors:Computer Science (CPSC)Data Science (DASC)Cannot be enrolled in one of the following Year Levels:Year 1 (1)